Classifications of Computable Structures
نویسندگان
چکیده
منابع مشابه
Classifications of Computable Structures
Let K be a family of structures, closed under isomorphism, in a fixed computable language. We consider e↵ective lists of structures from K such that every structure in K is isomorphic to exactly one structure on the list. Such a list is called a computable classification of K, up to isomorphism. Using the technique of Friedberg enumeration, we show that there is a computable classification of t...
متن کاملEmbeddings of Computable Structures
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.
متن کاملComputable Transformations of Structures
The isomorphism problem, for a class of structures, is the set of pairs of structures within that class which are isomorphic to each other. Isomorphism problems have been well studied for many classes of computable structures. Here we consider isomorphism problems for broader classes of countable structures, using Turing functionals and applying the notions of finitary and countable computable ...
متن کاملLocally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finitely generated substructures of S effectively. Our discussion emphasizes definitions and examples, but does prove two significant results. First, our notion of mextensional local computability of S ensures that the Σn-t...
متن کاملRelations on computable structures
Gődel’s incompleteness theorem from 1931 is an astonishing early result of computable mathematics. Gődel showed that “there are in fact relatively simple problems in the theory of ordinary whole numbers which cannot be decided from the axioms.” The work of Gődel, Turing, Kleene, Church, Post and others in the mid-1930’s established the rigorous mathematical foundations for the computability the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2018
ISSN: 0029-4527
DOI: 10.1215/00294527-2017-0015